github.com/andybalholm/brotli.histogramCommand.data_ (field)

23 uses

	github.com/andybalholm/brotli (current package)
		bit_cost.go#L187: 		if histogram.data_[i] > 0 {
		bit_cost.go#L205: 		var histo0 uint32 = histogram.data_[s[0]]
		bit_cost.go#L206: 		var histo1 uint32 = histogram.data_[s[1]]
		bit_cost.go#L207: 		var histo2 uint32 = histogram.data_[s[2]]
		bit_cost.go#L217: 			histo[i] = histogram.data_[s[i]]
		bit_cost.go#L245: 			if histogram.data_[i] > 0 {
		bit_cost.go#L246: 				var log2p float64 = log2total - fastLog2(uint(histogram.data_[i]))
		bit_cost.go#L252: 				bits += float64(histogram.data_[i]) * log2p
		bit_cost.go#L270: 				for k = i + 1; k < data_size && histogram.data_[k] == 0; k++ {
		block_splitter_command.go#L82: 			insert_cost[i*num_histograms+j] = insert_cost[j] - bitCost(uint(histograms[j].data_[i]))
		brotli_bit_stream.go#L1243: 			buildAndStoreHuffmanTree(histograms[i].data_[0:], self.histogram_length_, alphabet_size, tree, self.depths_[ix:], self.bits_[ix:], storage_ix, storage)
		brotli_bit_stream.go#L1436: 	buildAndStoreHuffmanTree(cmd_histo.data_[:], numCommandSymbols, numCommandSymbols, tree, cmd_depth[:], cmd_bits[:], storage_ix, storage)
		brotli_bit_stream.go#L1493: 		buildAndStoreHuffmanTreeFast(cmd_histo.data_[:], cmd_histo.total_count_, /* max_bits = */
		histogram.go#L58: 	data_        [numCommandSymbols]uint32
		histogram.go#L64: 	self.data_ = [numCommandSymbols]uint32{}
		histogram.go#L77: 	self.data_[val]++
		histogram.go#L89: 		self.data_[p[0]]++
		histogram.go#L98: 		self.data_[i] += v.data_[i]
		metablock.go#L568: 		optimizeHuffmanCountsForRLE(numCommandSymbols, mb.command_histograms[i].data_[:], good_for_rle[:])
		metablock_command.go#L75: 		last_entropy[0] = bitsEntropy(histograms[0].data_[:], self.alphabet_size_)
		metablock_command.go#L85: 		var entropy float64 = bitsEntropy(histograms[self.curr_histogram_ix_].data_[:], self.alphabet_size_)
		metablock_command.go#L94: 			combined_entropy[j] = bitsEntropy(combined_histo[j].data_[0:], self.alphabet_size_)